Logics for Coalitional Games
نویسندگان
چکیده
We define formalisms to reason about Coalitional Games (CGs), in which one can express what coalitions of agents can achieve. We start with Quantified CGs (QCGs), in which each agent has some goals he wants to satisfy, which may change over time. Then we focus on CGs themselves. Although CGs can be well analysed in a formalism close to Pauly’s Coalition Logic, in QCGs, when having preferences, some differences become apparent.
منابع مشابه
Logics for Qualitative Coalitional Games
Qualitative Coalitional Games (QCGs) are a variant of coalitional games in which an agent’s desires are represented as goals that are either satisfied or unsatisfied, and each choice available to a coalition is a set of goals, which would be jointly satisfied if the coalition made that choice. A coalition in a QCG will typically form in order to bring about a set of goals that will satisfy all ...
متن کاملState and path coalition effectivity models for logics of multi-player games
We consider models of multi-player games where abilities of players and coalitions are defined in terms of sets of outcomes which they can effectively enforce. We extend the well studied state effectivity models of one-step games in two different ways. On the one hand, we develop multiple state effectivity functions associated with different longterm temporal operators. On the other hand, we de...
متن کاملA logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goal to achieve, and in which agents must typically cooperate with others in order to satisfy their goals. In this paper, we show how it is possible to reason about QCGs using Coalition Logic (CL), a formalism intended t...
متن کاملExtended Modal Logics for Social Software
This is a short motivational report on work that we have done in two specific areas of Social Software, i.e. Coalitional Games and Judgement Aggregation. We argue that Extended Modal Logics prove to be particularly successful in the modeling and axiomatisation of reasoning problems in those areas. Here, we restrict ourselves to a description of the domains: technical details are to be found in ...
متن کاملCore Membership Computation for Succinct Representations of Coalitional Games
In this paper, I compare and contrast two formal results on the computational complexity of core membership determination in two compact representations of coalitional games. Conitzer and Sandholm [1] proposed the multi-issue representations of coalitional games. This representation attempts to decompose a coalitional games into a set of sub-games. Later, Ieong and Shoham [3] proposed the margi...
متن کامل